simplex method in linear programming
英 [ˈsɪmpleks ˈmeθəd ɪn ˈlɪniə(r) ˈprəʊɡræmɪŋ]
美 [ˈsɪmpleks ˈmeθəd ɪn ˈlɪniər ˈproʊɡræmɪŋ]
【经】线性规划中的单纯形法
双语例句
- Chapter five deals with some specializations of the simplex method and the development of optimality criteria in linear programming.
第五章处理一些专门的单纯形法和建立了线性规划的最优准则。 - Based on the convex simplex method for nonlinear programming, a sensitivity analysis of consumption coefficient matrix in linear fractional programming is presented.
基于解非线形规划的凸单纯形法，对一类线形分式规划的消耗系数矩阵进行灵敏度分析。 - At the present time the original simplex method is still used predominantly in solving practical linear programming problems. This paper expounds and proves that the simplex method adopting Blands theory is better than the original simplex method.
求解线性规划问题在目前实际应用中都是采用的原始单纯形法。本文论证了单纯形方法中用Bland方法要比原始单纯形方法为优。